Optimal Data Structures for Farthest-Point
نویسندگان
چکیده
6 Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph 7 with positive edge weights. We measure the distance between these points in terms of the weighted 8 shortest path distance, called the network distance. Within this metric space, we study farthest points 9 and farthest distances. We introduce optimal data structures supporting queries for the farthest distance 10 and the farthest points on trees, cycles, uni-cyclic networks, and cactus networks. 11
منابع مشابه
On Farthest-Point Information in Networks
Consider the continuum of points along the edges of a network, an embedded undirected graph with positive edge weights. Distance between these points can be measured as shortest path distance along the edges of the network. We introduce two new concepts to capture farthest-point information in this metric space. The first, eccentricity diagrams, are used to encode the distance towards farthest ...
متن کاملOptimal Data Structures for Farthest-Point Queries in Cactus Networks
Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest di...
متن کاملFarthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log2 n) time. Our data structure needs O(n logn) space and preprocessing time. To the best of our kno...
متن کاملw_0-Nearest Points and w_0-Farthest Point in Normed Linear Spaces
w0-Nearest Points and w0-Farthest Point in Normed Linear Spaces
متن کاملMinimum Enclosing Circle of a Set of Static Points with Dynamic Weight from One Free Point
Given a set S of n static points and a free point p in the Euclidean plane, we study a new variation of the minimum enclosing circle problem, in which a dynamic weight that equals to the reciprocal of the distance from the free point p to the undetermined circle center is included. In this work, we prove the optimal solution of the new problem is unique and lies on the boundary of the farthest-...
متن کامل